Search results for "generating tree"

showing 2 items of 2 documents

Restricted 123-avoiding Baxter permutations and the Padovan numbers

2007

AbstractBaxter studied a particular class of permutations by considering fixed points of the composite of commuting functions. This class is called Baxter permutations. In this paper we investigate the number of 123-avoiding Baxter permutations of length n that also avoid (or contain a prescribed number of occurrences of) another certain pattern of length k. In several interesting cases the generating function depends only on k and is expressed via the generating function for the Padovan numbers.

Discrete mathematicsClass (set theory)Golomb–Dickman constantStirling numbers of the first kindApplied MathematicsPadovan numbersGenerating functionFixed pointCombinatoricsPermutationDiscrete Mathematics and CombinatoricsTree (set theory)Generating treesBaxter permutationsForbidden subsequencesMathematicsDiscrete Applied Mathematics
researchProduct

ECO-generation for some restricted classes of compositions

2013

International audience; We study several restricted classes of compositions by giving one-to-one maps between them and different classes of restricted binary strings or pattern avoiding permutations. Inspired by the ECO method, new succession rules for these classes are presented. Finally, we obtain generating algorithms in Constant Amortized Time (CAT) for theses classes.

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]succession ruleComposition of an integerECO method[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]lcsh:Electronic computers. Computer science[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]generating treepattern avoiding permutationlcsh:QA75.5-76.95
researchProduct